Termination w.r.t. Q of the following Term Rewriting System could not be shown:
Q restricted rewrite system:
The TRS R consists of the following rules:
h(f(x, y)) → f(f(a, h(h(y))), x)
Q is empty.
↳ QTRS
↳ DependencyPairsProof
Q restricted rewrite system:
The TRS R consists of the following rules:
h(f(x, y)) → f(f(a, h(h(y))), x)
Q is empty.
Using Dependency Pairs [1,15] we result in the following initial DP problem:
Q DP problem:
The TRS P consists of the following rules:
H(f(x, y)) → H(h(y))
H(f(x, y)) → H(y)
The TRS R consists of the following rules:
h(f(x, y)) → f(f(a, h(h(y))), x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.
↳ QTRS
↳ DependencyPairsProof
↳ QDP
Q DP problem:
The TRS P consists of the following rules:
H(f(x, y)) → H(h(y))
H(f(x, y)) → H(y)
The TRS R consists of the following rules:
h(f(x, y)) → f(f(a, h(h(y))), x)
Q is empty.
We have to consider all minimal (P,Q,R)-chains.